A Construction for Periodically-Cyclic Gale 2m-Polytopes
نویسنده
چکیده
For each v, k and m such that v ≥ k ≥ 2m + 2 ≥ 8, we construct a periodically-cyclic Gale 2m-polytope with v vertices and the period k. For such a polytope, there is a complete description of each of its facets based upon a labelling (total ordering) of the vertices so that every subset of k successive vertices generates a cyclic 2m-polytope. MSC 2000: 52B11, 52B05
منابع مشابه
On Gale and braxial polytopes
Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...
متن کاملOn braxtopes, a class of generalized simplices
In a d-simplex every facet is a (d−1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this paper we study a new class, braxtopes, which arise as the faces of periodically-cyclic Gale polytopes. We give a geometric construction for these polytopes ...
متن کاملSubpolytopes of Cyclic Polytopes
A remarkable result of I. Shemer [4] states that the combinatorial structure of a neighbourly 2m-polytope determines the combinatorial structure of each of its subpolytopes. From this, it follows that every subpolytope of a cyclic 2m-polytope is cyclic. In this note, we present a direct proof of this consequence that also yields that certain subpolytopes of a cyclic (2m+ 1)-polytope are cyclic.
متن کاملFinding Gale Strings
Electronic Notes in Discrete Mathematics 36 (2010) 1065–1072 The problem 2-NASH of finding a Nash equilibrium of a bimatrix game belongs to the complexity class PPAD. This class comprises computational problems that are known to have a solution by means of a path-following argument. For bimatrix games, this argument is provided by the Lemke–Howson algorithm. It has been shown that this algorith...
متن کاملPeriodically correlated and multivariate symmetric stable processes related to periodic and cyclic flows
In this work we introduce and study discrete time periodically correlated stable processes and multivariate stationary stable processes related to periodic and cyclic flows. Our study involves producing a spectral representation and a spectral identification for such processes. We show that the third component of a periodically correlated stable process has a component related to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000